perm filename TOUR[S78,JMC] blob sn#361174 filedate 1978-06-14 generic text, type C, neo UTF8
COMMENT āŠ—   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	.require "memo.pub[let,jmc]" source
C00007 ENDMK
CāŠ—;
.require "memo.pub[let,jmc]" source;
	John McCarthy is Professor of Computer Science at Stanford
University and Director of the Stanford University Artificial
Intelligence Laboratory.  He received his PhD in Mathematics in 1951
from Princeton University and has taught at Princeton University,
Dartmouth College, Massachusetts Institute of Technology and
Stanford University.  He originated the LISP language for programming
with symbolic expressions in 1958 and started the first work on
time-sharing computer systems at M.I.T. in 1959.  His main scientific
interests are artificial intelligence, mathematical theory of computation
and recently computer communication.  He can lecture on the following
topics:

	Representation of Recursive Programs in First Order Logic

	Recursive programs written in LISP style can be replaced
by a functional equation in first order logic and an axiom schema
expressing the fact that the recursion gives the minimal solution
of the functional equation.  This represntation provides a convenient
formalism for proving properties of programs.

	Epistemological Problems of Artificial Intelligence

	Programs with general common sense intelligence require a
way of representing facts about the world and the general facts about
the effects of actions, about knowledge, and about goals and
subgoals.  Valid and conjectural modes of reasoning must also be
specified.  What these facts are and how to represent them can
advantageously be studied apart from the programs that use them.
These epistemological problems of artificial intelligence are related
to %2philosophical logic%1.  Some results will be reported about how
to represent facts about knowledge and a new conjectural but formal
mode of reasoning will be described.

	Dialnet

	Stanford University is developing a set of protocols for
communication between time-sharing systems using the dial-up
telephone network.  Users of computers implementing the Dialnet
protocols can send messages to users of any other computer in
the world implementing these protocols, can transmit files of
programs, data and reports, and can use their terminals as
though they were terminals on other computers.  The present state
of the Dialnet Project will be described.

	Low Overhead Time-sharing

	Stanford University has recently instituted a time-sharing
service for student use.  Based on a Digital Equipment 2050 computer,
80 terminals are available in two terminals rooms and over telephone
lines.  2500 to 3000 students are supported with a total staff of
four people.